On θ-cyclic codes over 𝔽2 + v𝔽2
نویسندگان
چکیده
In this paper we study θ-cyclic codes over the ring R = F2 + vF2 = {0, 1, v, v+1} where v = v. This is the only ring of order four that is not a field and has a non-trivial ring automorphism. We describe generator polynomials of θ-cyclic codes defined over this ring. We also describe the generator polynomials of the duals of free θ-cyclic codes with respect to Euclidean and Hermitian inner products. Finally, we give examples of optimal self-dual codes with respect to the Euclidean and Hermitian inner products. 116 T. ABUALRUB, N. AYDIN AND P. SENEVIRATNE
منابع مشابه
2-D skew constacyclic codes over R[x, y; ρ, θ]
For a finite field $mathbb{F}_q$, the bivariate skew polynomial ring $mathbb{F}_q[x,y;rho,theta]$ has been used to study codes cite{XH}. In this paper, we give some characterizations of the ring $R[x,y;rho,theta]$, where $R$ is a commutative ring. We investigate 2-D skew $(lambda_1,lambda_2)$-constacyclic codes in the ring $R[x,y;rho,theta]/langle x^l-lambda_1,y^s-lambda_2rangle_{mathit{l}}.$ A...
متن کاملCoding with skew polynomial rings
In analogy to cyclic codes, we study linear codes over finite fields obtained from left ideals in a quotient ring of a (non commutative) skew polynomial ring. The paper shows how existence and properties of such codes are linked to arithmetic properties of skew polynomials. This class of codes is a generalization of the θ-cyclic codes discussed in [1]. However θ-cyclic codes are performant repr...
متن کاملA Note on The Enumeration of Euclidean Self-Dual Skew-Cyclic Codes over Finite Fields
In this paper, we give the enumeration formulas for Euclidean selfdual skew-cyclic codes over finite fields when (n, |θ|) = 1 and for some cases when (n, |θ|) > 1, where n is the length of the code and |θ| is the order of automorphism θ.
متن کاملA Note on the Existence of Self-Dual Skew Codes over Finite Fields
Conditions on the existence of self-dual θ-codes defined over a finite field IFq are studied for θ automorphism of IFq. When q ≡ 1 (mod 4) it is proven that there always exists a self-dual θ-code in any dimension and that self-dual θ-codes of a given dimension are either all θ-cyclic or all θ-negacyclic. When q ≡ 3 (mod 4), there does not exist a selfdual θ-cyclic code and a necessary and suffi...
متن کاملSkew Generalized Quasi-cyclic Codes
This article discusses skew generalized quasi-cyclic codes over any finite field F with Galois automorphism θ. This is a generalization of quasi-cyclic codes and skew polynomial codes. These codes have an added advantage over quasi-cyclic codes since their lengths do not have to be multiples of the index. After a brief description of the skew polynomial ring F[x; θ], we show that a skew general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 54 شماره
صفحات -
تاریخ انتشار 2012